Optimizing Temporal Queries: Efficient Handling of Duplicates
نویسندگان
چکیده
Recent research in the area of temporal databases has proposed a number of query languages that vary in their expressive power and the semantics they provide to users. These query languages represent a spectrum of solutions to the tension between clean semantics and efficient evaluation. Often, these query languages are implemented by translating temporal queries into standard relational queries. However, the compiled queries are often quite cumbersome and expensive to execute even using state-ofthe-art relational products. This paper presents an optimization technique that produces more efficient translated SQL queries by taking into account the properties of the encoding used for temporal attributes. For concreteness, this translation technique is presented in the context of SQL/TP; however, these techniques are also applicable to other temporal query languages.
منابع مشابه
V.4: Sql/tp|a Temporal Extension of Sql
We use constraint technology as a basis for SQL/TP, a sound temporal extension of SQL. In contract to most of the earlier proposals, SQL/TP has clean syntax that is consistent with standard SQL, and unambiguous semantics that is rooted in the theory of constraint databases. We also deene a meaningful way of handling aggregation and duplicates, and provide an eecient implementation path on top o...
متن کاملA Foundation for Conventional and Temporal Query Optimization Addressing Duplicates and Ordering
Most real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a foundation for query opti...
متن کاملQuery Plans for Conventional and Temporal Queries Involving Duplicates and Ordering
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications could benefit substantially from builtin temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a general, a...
متن کاملOptimizing a Sequence of Frequent Pattern Queries
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user specifies the source dataset and pattern constraints using a given constraint model. A significant amount of research on efficient processing of frequent pattern queries has been done in recent years, focusing mainly on co...
متن کاملDesigning Views to Efficiently Answer Real SQL Queries
The problem of optimizing queries in the presence of materialized views and the related view-design problem have recently attracted a lot of attention. Significant research results have been reported, and materialized views are increasingly used in query evaluation in commercial data-management systems. At the same time, most results in the literature assume set-theoretic semantics, whereas SQL...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Data Knowl. Eng.
دوره 44 شماره
صفحات -
تاریخ انتشار 2001